#include <bits/stdc++.h>
using namespace std;
int n, r[100010], ans, tot;
int main(){
    freopen ("duel.in","r",stdin);
    freopen ("duel.out","w",stdout);
    scanf("%d", &n);
    for (int i=1; i<=n; i++)
        scanf("%d", &r[i]);
    sort(r+1, r+n+1); r[0]=-1;
    for (int i=1; i<=n; i++){
        if (r[i]==r[i-1]) tot++;
        else{ans=max(ans, tot); tot=1;}
    }
    ans=max(ans, tot);
    printf("%d\n", ans);
    return 0;
}
